Triangulation of Branching Contours Using Area Minimization
نویسندگان
چکیده
This paper presents a new method for reconstructing piecewise linear surfaces from planar polygonal contours that branch. For non-branching contours, experience has shown that the piecewise linear surface of minimum surface area which connects a pair of contours often provides a good solution. The current algorithm extends this idea by searching for the surface of minimal area which connects two contours comprised of more than one polygon. Several examples that justify this heuristic are provided.
منابع مشابه
Efficient surface reconstruction from contours based on two-dimensional Delaunay triangulation
This paper introduces an efficient method for surface reconstruction from sectional contours. The surface between neighbouring sections is reconstructed based on the consistent utilization of the twodimensional constrained Delaunay triangulation. The triangulation is used to extract the parametric domain and to solve the problems associated with correspondence, tiling and branching in a general...
متن کاملTriangulation of Cross-sectional Digital Straight Segments and Minimum Length Polygons for Surface Area Estimation
This paper proposes a new heuristic locally determined algorithm for the triangulation between points sequences representing serial sections of a surface. Moreover, a strategy for surface area estimation based on triangulation of cross sectional contours is described, where each contour is represented by its sequence of vertices of maximal digital straight segments (DSS), or by its minimal leng...
متن کاملFitting a Triangulation to Contour Lines
This paper presents a technique for creating a triangle mesh that tightly fits a terrain surface represented by a set of digitized contour lines. Basic to the technique is a Medial Axis transformation of a polygon, in this case formed by one or more contour lines. The advantages of using this mesh rather than the well known Delaunay triangulation for computing a gridded Digital Terrain Model (D...
متن کاملA new algorithm for triangulation from cross sections and its application to surface area estimation
This article proposes a new heuristic (locally determined) algorithm for the triangulation between point sequences representing cross-sectional contours of a surface. Such point sequence is required to be the set of vertices of a polygon representing a Jordan curve and approximating the contour. The algorithm which is applied directly to the whole point sequence, is very simple since it is base...
متن کاملContour curvature polarity and surface interpolation
Contour curvature polarity (i.e., concavity/convexity) is recognized as an important factor in shape perception. However, current interpolation models do not consider it among the factors that modulate the trajectory of amodally-completed contours. Two hypotheses generate opposite predictions about the effect of contour polarity on surface interpolation. Convexity advantage: if convexities are ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Int. J. Comput. Geometry Appl.
دوره 8 شماره
صفحات -
تاریخ انتشار 1998